Strategies for Bounding Volume Hierarchy Updates for Ray Tracing of Deformable Models
نویسندگان
چکیده
In this paper, we describe strategies for bounding volume hierarchy updates for ray tracing of deformable models. By using pre-built hierarchy structures and a lazy evaluation technique for updating the bounding volumes, the hierarchy reconstruction can be made very efficiently. Experiments show that for deforming triangle meshes the reconstruction time of the bounding volume hierarchies per frame can be reduced by an order of magnitude compared to previous approaches, which also results in a significant speed-up in the total rendering time for many types of dynamically changing scenes. We believe our approach is a step towards interactive ray tracing of scenes where moving objects can be dynamically changed in non-deterministic ways.
منابع مشابه
Interactive Ray Tracing of Massive and Deformable Models
Christian Lauterbach: Interactive Ray Tracing of Massive and Deformable Models. (Under the direction of Dinesh Manocha.) Ray tracing is a fundamental algorithm used for many applications such as computer graphics, geometric simulation, collision detection and line-of-sight computation. Even though the performance of ray tracing algorithms scales with the model complexity, the high memory requir...
متن کاملFast Insertion-Based Optimization of Bounding Volume Hierarchies
We present an algorithm for fast optimization of bounding volume hierarchies (BVH) for efficient ray tracing. We perform selective updates of the hierarchy driven by the cost model derived from the surface area heuristic. In each step the algorithm updates a fraction of the hierarchy nodes in order to minimize the overall hierarchy cost. The updates are realized by simple operations on the tree...
متن کاملGPU-based Ray Tracing of Dynamic Scenes
This paper presents the design and implementation of a GPU-based ray tracing system for dynamic scenes consisting of a set of individual, non-deformable objects. The triangles of each object are organized in a separate Kd-tree. A bounding volume hierarchy (BVH) is built on top of these Kd-trees. The BVH is updated and uploaded into GPU memory on a frame-by-frame basis, whereas the Kd-trees are ...
متن کاملFast, parallel, and asynchronous construction of BVHs for ray tracing animated scenes
Recent developments have produced several techniques for interactive ray tracing of dynamic scenes. In particular, bounding volume hierarchies (BVHs) are efficient acceleration structures that handle complex triangle distributions and can accommodate deformable scenes by updating (refitting) the bounding primitive without restructuring the entire tree. Unfortunately, updating only the bounding ...
متن کاملRay Tracing with the Single Slab Hierarchy
Bounding volume hierarchies have become a very popular way to speed up ray tracing. In this paper we present a novel traversal and approximation scheme for bounding volume hierarchies, which is comparable in speed, has a very compact traversal algorithm and uses only 25% of the memory, compared to a standard bounding volume hierarchy.
متن کامل